Network correlated data gathering with explicit communication: NP-completeness and algorithms
نویسندگان
چکیده
منابع مشابه
Trusses, NP-Completeness, and Genetic Algorithms
The optimization of large trusses often leads to a nearly optimal solution, rather than a truly optimal design. In fact, the problem space for truss optimization grows exponentially with the size of the truss. Using the method of problem reduction, this paper demonstrates that truss optimization is in the set of NP-complete problems. Hence, the only practical techniques for solving the truss pr...
متن کاملResilient data gathering and communication algorithms for emergency scenarios
A typical application field of Wireless Sensor Networks (WSNs) is the collection of environmental data, which is sent to a base station. Routing protocols are needed to efficiently direct the information flows to the base station. Since sensor nodes have strict energy constraints, data gathering and communication schemes for WSNs need to be designed for an efficient utilization of the available...
متن کاملContractibility and NP-completeness
For a fixed graph H, let H-CON denote the problem of determining whether a given graph is contractible to H. The complexity of H-CON is studied for H belonging to certain classes of graphs, together covering all connected graphs of order at most 4. In particular, H-CON is NP-complete if H is a connected triangle-free graph other than a star. For each connected graph H of order a t most 4 other ...
متن کاملBroadcasting and NP - completeness
In this note, we answer two questions arising in broadcasting problems in networks. We rst describe a new family of minimum broadcast graphs. Then we give a proof due to Alon of the NP-completeness of nding disjoint spanning trees of minimum depth, rooted at a given vertex.
متن کاملNP-Completeness and Disjoint NP-Pairs
We study the question of whether the class DisjNP of disjoint pairs (A,B) of NPsets contains a complete pair. The question relates to the question of whether optimal proof systems exist, and we relate it to the previously studied question of whether there exists a disjoint pair of NP-sets that is NP-hard. We show under reasonable hypotheses that nonsymmetric disjoint NP-pairs exist, which provi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2006
ISSN: 1063-6692
DOI: 10.1109/tnet.2005.863711